Codes Over Matrix Rings for Space-Time Coded Modulations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coded Transmit Macrodiversity: Block Space-Time Codes over Distributed Antennas

This paper considers the combination of space-time codes and macrodiversity to the cellular downlink. The antenna array used by the space-time code is comprised of the antennas of two or three geographically separated base stations. For ease of exposition and to reduce algorithmic complexity, we have restricted our attention in this paper to space-time block codes. Simulation results indicate a...

متن کامل

New space-time coding techniques with bit interleaved coded modulations

pour toute la sympathie qu'ils ont offert pendant mes séjours en Bretagne. Je remercie tous lescolì egues et amis du département COMELEC de l'ENST :Danì ele, Marc Fossorier de l'Université d'Hawaii, Emanuele Viterbo du Politecnico di Torino pour toutes les discussions techniques fructueuses et motivantes, et pour leur soutien inconditionnel. Bien ´ evidemment, je remercie toute l'´ equipe des t...

متن کامل

The equivalence of space-time codes and codes defined over finite fields and Galois rings

Space-time codes for a wide variety of channels have the property that the diversity of a pair of codeword matrices is measured by the vanishing or non-vanishing of polynomials in the entries of the matrices. We show that for every such channel: I) There is an appropriately-defined notion of approximation of space-time codes such that each code is arbitrarily well approximated by one whose alph...

متن کامل

Time-Varying Space-Only Codes for Coded MIMO

Multiple antenna (MIMO) devices are widely used to increase reliability and information bit rate. Optimal error rate performance (full diversity and large coding gain), for unknown channel state information at the transmitter and for maximal rate, can be achieved by approximately universal spacetime codes, but comes at a price of large detection complexity, infeasible for most practical systems...

متن کامل

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2012

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2173732